An Adaptive Solution to Ranking and Selection Problems
نویسندگان
چکیده
منابع مشابه
AN ADAPTIVE WAVELET SOLUTION TO GENERALIZED STOKES PROBLEM
In this paper we will present an adaptive wavelet scheme to solvethe generalized Stokes problem. Using divergence free wavelets, theproblem is transformed into an equivalent matrix vector system, thatleads to a positive definite system of reduced size for thevelocity. This system is solved iteratively, where the applicationof the infinite stiffness matrix, that is sufficiently compressible,is r...
متن کاملAn Adaptive Problem-Solving Solution to Large-Scale Scheduling Problems
Although the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, domain-specific techniques frequently solve problems in much better than exponential time. Unfortunately, constructing special-purpose systems is a knowledge–intensive and time-consuming process that requires a deep understanding of the domain and problem-solving architecture. The goal of ou...
متن کاملAn Adaptive Physics-Based Method for the Solution of One-Dimensional Wave Motion Problems
In this paper, an adaptive physics-based method is developed for solving wave motion problems in one dimension (i.e., wave propagation in strings, rods and beams). The solution of the problem includes two main parts. In the first part, after discretization of the domain, a physics-based method is developed considering the conservation of mass and the balance of momentum. In the second part, ada...
متن کاملAdaptive ε-Ranking on many-objective problems
This work proposes Adaptive e-Ranking to enhance Pareto based selection, aiming to develop effective many-objective evolutionary optimization algorithms. eRanking fine grains ranking of solutions after they have been ranked by Pareto dominance, using a randomized sampling procedure combined with e-dominance to favor a good distribution of the samples. In the proposed method, sampled solutions k...
متن کاملLikelihood Ratio Procedures for Subset Selection and Ranking Problems
This report deals with procedures for random-size subset selection from k(> 2) given populations where the distribution of ir^(i = l, ..., k) has a density f^(x;0^). Let ••• -®[k] denote unknown values of the parameters, and let ^[i]» ***'ïï[k] denote the corresponding populations. First, we have considered the problem of selection for consider the /s procedure that selects TT. if sup L(0;x) > ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1978
ISSN: 0090-5364
DOI: 10.1214/aos/1176344210